Model Checking: A Complexity-Theoretic Perspective

Model Checking: A Complexity-Theoretic Perspective (invited talk)

In model checking one uses algorithmic techniques to establish thecorrectness of the design with respect to a given property. Model checking is based on a small number of key algorithmic ideas, tying together graph theory, automata theory, and logic. In the last few years, this area has seen a dramatic expansion of activities. Today many companies cannot wait to get the most advanced tools avai...

Automata-Theoretic Model Checking Revisited

In automata-theoretic model checking we compose the design under verification with a Büchi automaton that accepts traces violating the specification. We then use graph algorithms to search for a counterexample trace. The basic theory of this approach was worked out in the 1980s, and the basic algorithms were developed during the 1990s. Both explicit and symbolic implementations, such as SPIN an...

Coordination: A model-theoretic perspective

Model Checking: Historical Perspective

Model checking is an automatic verification technique for finite state concurrent systems such as sequential circuit designs and communication protocols. Specifications are expressed in propositional temporal logic. An exhaustive search of the global state transition graph or system model is used to determine if the specification is true or not. If the specification is not satisfied, a countere...

Plan Modiication versus Plan Generation: a Complexity-theoretic Perspective

The ability of a planner to modify a plan is considered as a valuable tool for improving ee-ciency of planning by avoiding the repetition of the same planning eeort. From a computational complexity point of view, however, it is by no means obvious that modifying a plan is computationally as easy as planning from scratch if the modiication has to follow the principle of \conservatism," i.e., to ...